Provably Secure Symmetric Private Information Retrieval with Quantum Cryptography
نویسندگان
چکیده
منابع مشابه
Secure quantum private information retrieval using phase-encoded queries
We propose a quantum solution to the classical private information retrieval (PIR) problem, which allows one to query a database in a private manner. The protocol offers privacy thresholds and allows the user to obtain information from a database in a way that offers the potential adversary, in this model the database owner, no possibility of deterministically establishing the query contents. T...
متن کاملProvably Secure Policy-Based Cryptography
The concept of policy-based cryptography (PBC) is a promising paradigm for trust establishment and authorization in large-scale open environments. A policy-based encryption scheme (PBE) allows to encrypt a message according to a policy so that only entities fulfilling the policy are able to perform the decryption of the message. Symmetrically, a policy-based signature scheme (PBS) assures that ...
متن کاملQuantum Symmetrically-Private Information Retrieval
Private information retrieval systems (PIRs) allow a user to extract an item from a database that is replicated over k ≥ 1 servers, while satisfying various privacy constraints. We exhibit quantum k-server symmetrically-private information retrieval systems (QSPIRs) that use sublinear communication, do not use shared randomness among the servers, and preserve privacy against honest users and di...
متن کاملEfficient Private Information Retrieval Using Secure Hardware
Existing crypto-based Private Information Retrieval (PIR) schemes are either limited in the set of queries they can perform, or have prohibitively large performance overheads in making query comparisons. On the other hand, most previous tamper-resistant hardware schemes can support more general queries and have lower performance overheads, but need to trust that the query program will not leak ...
متن کاملQuantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts
Recent results of Kaplan et al., building on previous work by Kuwakado and Morii, have shown that a wide variety of classically-secure symmetric-key cryptosystems are completely broken when exposed to quantum CPA attacks. In such an attack, the quantum adversary has the ability to query the cryptographic functionality in superposition. The vulnerable cryptosystems include the Even-Mansour block...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2020
ISSN: 1099-4300
DOI: 10.3390/e23010054